class Solution:
    def searchInsertPosition(self , nums , target ):
        # write code here
        if nums==[]:return 0
        if target in nums:
            return nums.index(target)
        else:
            count = 0
            for i in range(len(nums)):
                if nums[i] < target:
                    # print()
                    count+=1
            return count

print(Solution().searchInsertPosition([],a))

# 70%
